Efficient explicit formulae for genus 3 hyperelliptic curve cryptosystems over binary fields
نویسندگان
چکیده
The ideal class groups of hyperelliptic curves(HECs) can be used in cryptosystems based on the discrete loga-rithm problem. Recent developments of computational technolo-gies for scalar multiplications of divisor classes have shown thatthe performance of hyperelliptic curve cryptosystems (HECC) iscompatible to that of elliptic curve cryptosystems (ECC). Espe-cially, genus 3 HECC are well suited for all kinds of embeddedprocessor architectures, where resources such as storage, time orpower are constrained, because of their short operand sizes. Inthis paper, we investigate the efficient explicit formulae for genus3 HECs over both prime fields and binary fields, and analyze howmany field operations are needed. First, we improve the explicitformulae for genus 3 HECs over binary fields using the thetadivisors which can save about 20% ∼ 50% multiplications forfour cases, and extend the method to genus 3 HECs over primefields. We then discuss acceleration of the divisor class doublingfor genus 3 HECs over binary fields. By constructing birationaltransformations of variables, we find four types of curves whichcan lead to much faster divisor class doubling and give thecorresponding explicit formulae. Especially, for special genus 3HECs over binary fields with h(X) = 1, we obtain the fastestexplicit doubling formula which only requires 1I + 10M + 11S.Thirdly, we propose the inversion-free explicit formulae for genus3 HEC over both prime fields and binary fields by introducingone more coordinate to collect the common denominator of theusual six coordinates. Finally, comparisons with the known resultsin terms of field operations and an implementation of genus 3HECC over three binary fields on a Pentium-4 processor areprovided.
منابع مشابه
Efficient Divisor Class Halving on Genus Two Curves
Efficient halving of divisor classes offers the possibility to improve scalar multiplication on hyperelliptic curves and is also a step towards giving hyperelliptic curve cryptosystems all the features that elliptic curve systems have. We present a halving algorithm for divisor classes of genus 2 curves over finite fields of characteristic 2. We derive explicit halving formulae from a doubling ...
متن کاملEfficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae
We extend the explicit formulae for arithmetic on genus two curves of [13, 21] to fields of even characteristic and to arbitrary equation of the curve. These formulae can be evaluated faster than the more general Cantor algorithm and allow to obtain faster arithmetic on a hyperelliptic genus 2 curve than on elliptic curves. We give timings for implementations using various libraries for the fie...
متن کاملEfficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on the Jacobian. Using some recoding algorithms for scalar k, we can reduce a number of divisor class additions during the process of computing scalar multiplication. So divisor doubling will account for the main part in...
متن کاملHyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves (Update)
For most of the time since they were proposed, it was widely believed that hyperelliptic curve cryptosystems (HECC) carry a substantial performance penalty compared to elliptic curve cryptosystems (ECC) and are, thus, not too attractive for practical applications. Only quite recently improvements have been made, mainly restricted to curves of genus 2. The work at hand advances the state-of-thea...
متن کاملFast explicit formulae for genus 2 hyperelliptic curves using projective coordinates (Updated)
This contribution proposes a modification of method of divisors group operation in the Jacobian of hyperelliptic curve over even and odd characteristic fields in projective coordinate. The hyperelliptic curve cryptosystem (HECC), enhances cryptographic security efficiency in e.g. information and telecommunications systems (ITS). Index Terms – hyperelliptic curves, explicit formulae.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IET Information Security
دوره 1 شماره
صفحات -
تاریخ انتشار 2007